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 listSep 17, 2026 02:45Andrew EpsteinAndrew EpsteinScore: 3,370Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 02:473,35836,581,03426,846,0001,030,0002,113,536
2Sep 17, 2026 02:473,35936,540,79626,875,0001,009,0002,113,536
3Sep 17, 2026 02:473,36336,422,26026,893,0001,025,0002,113,536
4Sep 17, 2026 02:473,36836,632,52826,943,0001,012,0002,113,536
5Sep 17, 2026 02:473,37036,671,93126,955,0001,022,0002,113,536
6Sep 17, 2026 02:473,38237,051,86527,015,0001,059,0002,113,536
7Sep 17, 2026 02:473,38936,782,53527,110,0001,019,0002,113,536
8Sep 17, 2026 02:473,38936,625,49927,079,0001,053,0002,113,536
9Sep 17, 2026 02:473,43037,486,10727,386,0001,091,0002,113,536