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 listSep 23, 2026 09:02Kevin HeaveyKevin HeaveyScore: 3,229Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 09:033,20035,395,78925,438,0001,128,0002,113,536
2Sep 23, 2026 09:033,21135,402,34425,523,0001,133,0002,113,536
3Sep 23, 2026 09:033,21235,480,19425,526,0001,140,0002,113,536
4Sep 23, 2026 09:033,21835,326,52725,565,0001,151,0002,113,536
5Sep 23, 2026 09:033,22935,735,56225,788,0001,013,0002,113,536
6Sep 23, 2026 09:033,23935,699,89725,855,0001,030,0002,113,536
7Sep 23, 2026 09:033,24435,714,19025,912,0001,021,0002,113,536
8Sep 23, 2026 09:033,24636,444,27125,925,0001,020,0002,113,536
9Sep 23, 2026 09:033,25936,637,55825,838,0001,213,0002,113,536