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 listMay 19, 2026 22:04M-RochatM-RochatScore: 37,142Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 22:0437,128317,574,099306,026,0002,140,0002,113,536
2May 19, 2026 22:0437,131319,354,918306,186,0002,005,0002,113,536
3May 19, 2026 22:0437,138318,240,418306,212,0002,036,0002,113,536
4May 19, 2026 22:0437,139319,416,399306,238,0002,020,0002,113,536
5May 19, 2026 22:0437,142318,326,313306,267,0002,019,0002,113,536
6May 19, 2026 22:0437,145317,789,710306,101,0002,206,0002,113,536
7May 19, 2026 22:0437,149317,853,665306,216,0002,121,0002,113,536
8May 19, 2026 22:0437,157321,629,111306,354,0002,055,0002,113,536
9May 19, 2026 22:0437,168319,796,251306,485,0002,017,0002,113,536