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 15, 2026 18:27boop34boop34Score: 9,240Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2026 18:289,20986,070,68375,427,0001,008,0002,113,536
2Jul 15, 2026 18:289,22386,177,04475,547,0001,010,0002,113,536
3Jul 15, 2026 18:289,22986,263,66175,597,0001,006,0002,113,536
4Jul 15, 2026 18:289,23086,365,65275,607,0001,006,0002,113,536
5Jul 15, 2026 18:289,24086,283,89375,690,0001,008,0002,113,536
6Jul 15, 2026 18:289,24186,394,39575,680,0001,028,0002,113,536
7Jul 15, 2026 18:289,28486,623,06776,055,0001,005,0002,113,536
8Jul 15, 2026 18:289,31786,907,88076,329,0001,005,0002,113,536
9Jul 15, 2026 18:289,40387,801,00877,027,0001,022,0002,113,536