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 19:23Josu San MartinJosu San MartinError
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 19:23041,380,97031,236,0001,089,0002,113,536expected "53683968230315808 ", got "53683967888696483 "
2May 10, 2026 19:233,88441,736,70131,182,0001,062,0002,113,536
3May 10, 2026 19:233,88939,961,55631,210,0001,076,0002,113,536
4May 10, 2026 19:233,88940,850,13831,225,0001,055,0002,113,536
5May 10, 2026 19:233,89041,627,93531,209,0001,082,0002,113,536
6May 10, 2026 19:233,89741,925,72831,246,0001,100,0002,113,536
7May 10, 2026 19:233,90242,183,09531,319,0001,072,0002,113,536
8May 10, 2026 19:233,91140,255,31131,421,0001,046,0002,113,536
9May 10, 2026 19:233,92342,677,24331,452,0001,109,0002,113,536