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 17:43Josu San MartinJosu San MartinScore: 11,432Success
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 17:4411,319103,251,52687,263,0006,686,0002,117,632
2Jul 3, 2026 17:4411,326103,437,16187,325,0006,681,0002,117,632
3Jul 3, 2026 17:4411,364103,666,46587,729,0006,597,0002,117,632
4Jul 3, 2026 17:4411,375103,769,16587,476,0006,937,0002,121,728
5Jul 3, 2026 17:4411,432104,214,42488,073,0006,816,0002,117,632
6Jul 3, 2026 17:4411,434104,260,79488,142,0006,767,0002,121,728
7Jul 3, 2026 17:4411,498104,768,15188,627,0006,813,0002,121,728
8Jul 3, 2026 17:4411,551105,305,80289,053,0006,825,0002,121,728
9Jul 3, 2026 17:4411,594105,570,71289,503,0006,733,0002,117,632