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 listFeb 10, 2026 19:19Daniel MastalerzDaniel MastalerzScore: 8,540Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 10, 2026 19:198,34497,978,54865,243,0004,014,0002,375,680
2Feb 10, 2026 19:198,37292,309,41366,469,0003,021,0002,326,528
3Feb 10, 2026 19:198,38299,776,32166,545,0003,024,0002,273,280
4Feb 10, 2026 19:198,54097,789,42867,889,0002,995,0002,265,088
5Feb 10, 2026 19:198,59995,780,65867,353,0004,021,0002,322,432
6Feb 10, 2026 19:198,61093,695,89870,457,0001,006,0002,301,952