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 15:10Hung T.NguyenHung T.NguyenScore: 44,519Success
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 15:1044,510395,549,182368,433,0001,001,0002,404,352
2Mar 13, 2026 15:1044,519394,496,654368,509,0001,001,0002,269,184
3Mar 13, 2026 15:1044,535394,503,466367,646,0001,998,0002,269,184