Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listNov 3, 2026 09:37Andrew EpsteinAndrew EpsteinScore: 37,381Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 3, 2026 09:4736,949315,986,475302,178,0004,501,0002,121,728stderr
2Nov 3, 2026 09:4736,995316,356,529302,676,0004,389,0002,121,728stderr
3Nov 3, 2026 09:4737,153317,585,112303,908,0004,465,0002,121,728stderr
4Nov 3, 2026 09:4737,252318,522,937304,737,0004,460,0002,121,728stderr
5Nov 3, 2026 09:4737,381320,105,788305,874,0004,390,0002,121,728stderr
6Nov 3, 2026 09:4737,393319,732,789305,952,0004,416,0002,121,728stderr
7Nov 3, 2026 09:4737,635321,642,030307,807,0004,567,0002,121,728stderr
8Nov 3, 2026 09:4738,023324,947,161311,218,0004,376,0002,121,728stderr
9Nov 3, 2026 09:4738,173326,120,604312,354,0004,490,0002,121,728stderr