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 6, 2026 07:38Kevin HeaveyKevin HeaveyScore: 4,707Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 07:394,59547,675,16436,895,0001,250,0002,117,632
2Jul 6, 2026 07:394,62447,931,57037,196,0001,190,0002,117,632
3Jul 6, 2026 07:394,66648,265,47237,471,0001,262,0002,117,632
4Jul 6, 2026 07:394,69148,450,13737,796,0001,144,0002,117,632
5Jul 6, 2026 07:394,70748,632,28737,827,0001,246,0002,117,632
6Jul 6, 2026 07:394,77649,158,08638,498,0001,151,0002,117,632
7Jul 6, 2026 07:394,81449,482,72538,805,0001,155,0002,117,632
8Jul 6, 2026 07:394,81649,445,09938,769,0001,204,0002,117,632
9Jul 6, 2026 07:394,88350,038,02339,339,0001,195,0002,117,632