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:42Kevin HeaveyKevin HeaveyScore: 4,729Success
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:424,63448,421,44537,250,0001,216,0002,117,632
2Jul 6, 2026 07:424,64548,132,98737,291,0001,265,0002,117,632
3Jul 6, 2026 07:424,71248,680,53238,096,0001,017,0002,117,632
4Jul 6, 2026 07:424,72748,791,77537,994,0001,246,0002,117,632
5Jul 6, 2026 07:424,72948,843,11838,098,0001,153,0002,117,632
6Jul 6, 2026 07:424,73448,822,72938,081,0001,214,0002,117,632
7Jul 6, 2026 07:424,75249,048,07938,225,0001,217,0002,117,632
8Jul 6, 2026 07:424,77249,157,01438,365,0001,247,0002,117,632
9Jul 6, 2026 07:424,97150,765,18540,114,0001,153,0002,117,632