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 listFeb 10, 2026 22:22Daniel MastalerzDaniel MastalerzScore: 8,685Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 10, 2026 22:228,49394,658,52668,476,0002,014,0002,265,088
2Feb 10, 2026 22:228,50496,465,38368,564,0002,016,0002,265,088
3Feb 10, 2026 22:228,52895,944,70668,791,0001,993,0002,277,376
4Feb 10, 2026 22:228,68595,305,34168,078,0004,004,0002,322,432
5Feb 10, 2026 22:228,69096,480,43268,121,0004,007,0002,375,680
6Feb 10, 2026 22:228,69798,449,73069,182,0003,007,0002,260,992