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 listSep 22, 2026 18:31stdkFeanorstdkFeanorScore: 76,117Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 22, 2026 18:3275,013632,931,671621,554,0001,057,0002,113,536
2Sep 22, 2026 18:3275,999641,234,146629,749,0001,048,0002,113,536
3Sep 22, 2026 18:3276,076641,794,165630,384,0001,048,0002,113,536
4Sep 22, 2026 18:3276,104642,029,088630,659,0001,006,0002,113,536
5Sep 22, 2026 18:3276,117643,323,579630,712,0001,063,0002,113,536
6Sep 22, 2026 18:3276,126642,291,305630,836,0001,012,0002,113,536
7Sep 22, 2026 18:3276,136642,312,776630,880,0001,050,0002,113,536
8Sep 22, 2026 18:3276,162642,562,311631,035,0001,115,0002,113,536
9Sep 22, 2026 18:3276,278643,521,149632,028,0001,086,0002,113,536