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 10, 2026 18:58zielajzielajError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 18:59035,112,26026,332,0001,015,0002,113,536expected "53681912594813137 ", got "53681912525005621 "
2May 10, 2026 18:593,29036,980,61826,287,0001,024,0002,113,536
3May 10, 2026 18:593,29435,703,29727,345,00002,113,536
4May 10, 2026 18:593,29435,602,81626,341,0001,005,0002,113,536
5May 10, 2026 18:593,29834,745,28326,360,0001,014,0002,113,536
6May 10, 2026 18:593,29934,885,93026,354,0001,030,0002,113,536
7May 10, 2026 18:593,30235,544,64326,393,0001,018,0002,113,536
8May 10, 2026 18:593,31135,334,62226,479,0001,005,0002,113,536
9May 10, 2026 18:593,31335,683,64126,466,0001,037,0002,113,536