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 listJan 2, 2026 17:26Josu San MartinJosu San MartinScore: 5,892Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 17:265,51972,437,23143,815,0001,991,0002,367,488
2Jan 2, 2026 17:265,70176,728,22646,310,0001,006,0002,289,664
3Jan 2, 2026 17:265,76377,894,34445,837,0001,992,0002,363,392
4Jan 2, 2026 17:265,81575,573,10347,259,0001,005,0002,355,200
5Jan 2, 2026 17:265,83771,257,15948,449,00002,285,568
6Jan 2, 2026 17:265,87876,102,91047,791,000995,0002,285,568
7Jan 2, 2026 17:265,89280,241,31447,904,000998,0002,510,848
8Jan 2, 2026 17:265,90875,809,00147,033,0002,001,0002,293,760
9Jan 2, 2026 17:265,91572,932,38048,093,0001,001,0002,289,664
10Jan 2, 2026 17:265,98281,218,64048,640,0001,013,0002,289,664
11Jan 2, 2026 17:266,00176,016,54347,816,0001,992,0002,363,392
12Jan 2, 2026 17:266,13676,934,38148,932,0001,997,0002,293,760