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 listMay 9, 2026 14:29wnwnScore: 3,417Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 14:293,37242,850,53226,952,0001,037,0002,490,368
2May 9, 2026 14:293,38042,222,33926,965,0001,096,0002,478,080
3May 9, 2026 14:293,40544,225,66527,191,0001,071,0002,486,272
4May 9, 2026 14:293,40540,614,95827,201,0001,064,0002,469,888
5May 9, 2026 14:293,41742,769,22527,301,0001,062,0002,490,368
6May 9, 2026 14:293,42244,063,04827,270,0001,138,0002,482,176
7May 9, 2026 14:293,42240,918,66227,345,0001,058,0002,482,176
8May 9, 2026 14:293,44142,929,53727,479,0001,083,0002,490,368
9May 9, 2026 14:293,54547,655,19528,355,0001,071,0002,490,368