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 13, 2026 18:45M-RochatM-RochatScore: 19,982Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 18:4519,904173,923,003164,173,0001,035,0002,113,536
2May 13, 2026 18:4519,923175,464,030164,285,0001,076,0002,113,536
3May 13, 2026 18:4519,943177,107,100164,509,0001,023,0002,113,536
4May 13, 2026 18:4519,961174,651,349164,616,0001,062,0002,113,536
5May 13, 2026 18:4519,982174,633,179164,817,0001,037,0002,113,536
6May 13, 2026 18:4520,107177,595,818165,793,0001,098,0002,113,536
7May 13, 2026 18:4520,142176,992,255166,131,0001,049,0002,113,536
8May 13, 2026 18:4520,210177,301,993166,726,0001,024,0002,113,536
9May 13, 2026 18:4520,221178,506,489166,803,0001,032,0002,113,536