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 19, 2026 04:20wnwnScore: 3,746Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2026 04:203,71659,890,59128,852,0001,989,0002,494,464
2Apr 19, 2026 04:203,72061,291,68929,844,0001,029,0002,277,376
3Apr 19, 2026 04:203,73061,337,20028,958,0001,997,0002,494,464
4Apr 19, 2026 04:203,74653,755,97529,085,0002,005,0002,269,184
5Apr 19, 2026 04:203,74956,378,12029,110,0002,007,0002,490,368
6Apr 19, 2026 04:203,78156,896,67530,374,0001,012,0002,531,328