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 listMar 13, 2026 10:11Hung T.NguyenHung T.NguyenScore: 92,492Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 10:1192,286787,257,255765,973,00002,437,120
2Mar 13, 2026 10:1192,492789,819,229766,682,000999,0002,437,120
3Mar 13, 2026 10:1192,511794,339,788767,845,00002,523,136