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 listJul 21, 2026 05:19Kevin HeaveyKevin HeaveyScore: 4,302Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 21, 2026 05:194,05443,282,84732,416,0001,238,0002,113,536
2Jul 21, 2026 05:194,20644,589,26433,694,0001,220,0002,113,536
3Jul 21, 2026 05:194,23044,712,39334,089,0001,026,0002,113,536
4Jul 21, 2026 05:194,25244,837,25634,109,0001,187,0002,113,536
5Jul 21, 2026 05:194,30245,359,69034,507,0001,207,0002,113,536
6Jul 21, 2026 05:194,31645,455,80934,643,0001,181,0002,113,536
7Jul 21, 2026 05:194,76749,220,25538,378,0001,194,0002,113,536
8Jul 21, 2026 05:194,78249,250,62838,514,0001,179,0002,113,536
9Jul 21, 2026 05:194,78349,308,26238,501,0001,200,0002,113,536