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 3, 2026 18:13Josu San MartinJosu San MartinScore: 9,927Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 18:139,85291,112,28275,025,0006,751,0002,117,632
2Jul 3, 2026 18:139,89691,560,03575,322,0006,817,0002,117,632
3Jul 3, 2026 18:139,90891,591,15875,290,0006,952,0002,121,728
4Jul 3, 2026 18:139,92291,670,45575,551,0006,805,0002,121,728
5Jul 3, 2026 18:139,92791,817,58975,663,0006,737,0002,121,728
6Jul 3, 2026 18:139,93391,833,41775,528,0006,922,0002,121,728
7Jul 3, 2026 18:139,95191,911,92975,888,0006,709,0002,117,632
8Jul 3, 2026 18:139,96392,074,65775,829,0006,866,0002,121,728
9Jul 3, 2026 18:1310,04393,389,66176,482,0006,881,0002,121,728