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 listJan 31, 2026 11:52olliecrowolliecrowScore: 8,137Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 31, 2026 11:526,71287,564,65948,744,0006,963,0002,510,848
2Jan 31, 2026 11:526,83486,554,01253,737,0002,985,0002,519,040
3Jan 31, 2026 11:526,89280,996,67250,179,0007,025,0002,506,752
4Jan 31, 2026 11:528,13791,461,35060,583,0006,952,0002,469,888
5Jan 31, 2026 11:528,138103,989,04657,610,0009,932,0002,514,944
6Jan 31, 2026 11:528,14894,687,88858,676,0008,950,0002,289,664