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 20:42Josu San MartinJosu San MartinScore: 8,496Success
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 20:428,38378,958,01263,074,0006,512,0002,121,728
2Jul 3, 2026 20:428,41679,247,21563,136,0006,723,0002,121,728
3Jul 3, 2026 20:428,43479,399,03663,201,0006,809,0002,121,728
4Jul 3, 2026 20:428,48979,824,36663,524,0006,939,0002,121,728
5Jul 3, 2026 20:428,49679,762,15463,768,0006,751,0002,117,632
6Jul 3, 2026 20:428,49979,900,95763,542,0007,004,0002,121,728
7Jul 3, 2026 20:428,52680,122,65263,792,0006,975,0002,117,632
8Jul 3, 2026 20:428,53381,508,10163,838,0006,989,0002,117,632
9Jul 3, 2026 20:428,54280,224,95263,829,0007,075,0002,117,632