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 19, 2026 19:57wnwnScore: 5,079Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 19:575,04566,279,95539,877,0001,993,0002,494,464
2Feb 19, 2026 19:575,06465,429,85640,034,0002,001,0002,277,376
3Feb 19, 2026 19:575,07562,925,71440,119,0002,005,0002,535,424
4Feb 19, 2026 19:575,07761,732,93240,136,0002,006,0002,490,368
5Feb 19, 2026 19:575,07968,729,20940,146,0002,007,0002,531,328
6Feb 19, 2026 19:575,08766,096,77840,208,0002,010,0002,498,560
7Feb 19, 2026 19:575,10164,998,08341,329,0001,008,0002,277,376
8Feb 19, 2026 19:575,11766,737,83341,460,0001,011,0002,490,368
9Feb 19, 2026 19:575,15774,770,83540,810,0001,990,0002,277,376