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 listMar 15, 2026 19:47Eric CeglieEric CeglieScore: 8,995Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 19:478,883106,191,09872,722,0001,010,0002,289,664
2Mar 15, 2026 19:478,891105,634,39172,796,000997,0002,338,816
3Mar 15, 2026 19:478,89798,336,82671,850,0001,995,0002,289,664
4Mar 15, 2026 19:478,91398,784,01369,979,0003,998,0002,289,664
5Mar 15, 2026 19:478,995106,110,61071,675,0002,986,0002,342,912
6Mar 15, 2026 19:478,99698,566,55372,652,0002,018,0002,506,752
7Mar 15, 2026 19:479,028100,338,40371,932,0002,997,0002,330,624
8Mar 15, 2026 19:479,115105,811,57373,639,0002,017,0002,289,664
9Mar 15, 2026 19:479,132102,183,37573,803,0001,994,0002,289,664