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 listApr 12, 2026 21:29zielajzielajScore: 3,499Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 12, 2026 21:303,42048,291,62927,369,0001,013,0002,510,848
2Apr 12, 2026 21:303,42251,359,64327,389,0001,014,0002,433,024
3Apr 12, 2026 21:293,44650,238,00627,580,0001,021,0002,486,272
4Apr 12, 2026 21:303,49953,216,67427,038,0002,002,0002,433,024
5Apr 12, 2026 21:293,53650,510,36828,334,0001,011,0002,519,040
6Apr 12, 2026 21:293,53856,207,36228,357,0001,012,0002,437,120