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:57Josu San MartinJosu San MartinScore: 12,616Success
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:5712,453112,750,76791,064,00012,301,0002,121,728
2Jul 3, 2026 17:5712,499113,048,28691,029,00012,713,0002,121,728
3Jul 3, 2026 17:5712,600113,883,32591,487,00013,101,0002,125,824
4Jul 3, 2026 17:5712,609113,997,48592,322,00012,335,0002,121,728
5Jul 3, 2026 17:5712,616115,432,75791,540,00013,179,0002,121,728
6Jul 3, 2026 17:5712,626114,174,22792,031,00012,765,0002,125,824
7Jul 3, 2026 17:5712,629114,128,35291,757,00013,071,0002,125,824
8Jul 3, 2026 17:5712,669114,478,23092,409,00012,748,0002,121,728
9Jul 3, 2026 17:5713,720123,242,678101,026,00012,853,0002,117,632