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 listMay 7, 2026 20:09Sanketh B KSanketh B KScore: 89,139Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 20:0989,078755,908,034680,270,00059,085,0002,355,200
2May 7, 2026 20:0989,110753,737,598680,224,00059,396,0002,359,296
3May 7, 2026 20:0989,114756,737,952680,273,00059,379,0002,363,392
4May 7, 2026 20:0989,135756,463,247680,340,00059,482,0002,355,200
5May 7, 2026 20:0989,139754,622,344680,326,00059,532,0002,367,488
6May 7, 2026 20:0989,143760,242,632680,711,00059,177,0002,367,488
7May 7, 2026 20:0989,155762,839,959680,291,00059,699,0002,363,392
8May 7, 2026 20:0989,198755,203,142679,570,00060,777,0002,322,432
9May 7, 2026 20:0989,267759,046,037680,292,00060,630,0002,367,488