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 17, 2026 03:40zielajzielajScore: 3,521Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 03:403,49253,367,91726,985,0001,998,0002,506,752
2Mar 17, 2026 03:403,49354,000,08726,997,0001,999,0002,514,944
3Mar 17, 2026 03:403,51153,578,17827,133,0002,009,0002,437,120
4Mar 17, 2026 03:403,51150,558,23727,133,0002,009,0002,519,040
5Mar 17, 2026 03:403,52151,064,54427,210,0002,015,0002,527,232
6Mar 17, 2026 03:403,52651,620,62627,245,0002,018,0002,437,120
7Mar 17, 2026 03:403,52653,715,86527,247,0002,018,0002,437,120
8Mar 17, 2026 03:403,53550,289,27927,320,0002,023,0002,424,832
9Mar 17, 2026 03:403,53950,262,31428,359,0001,012,0002,478,080