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 6, 2026 10:38Kevin HeaveyKevin HeaveyScore: 3,544Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 10:403,51639,293,12727,970,0001,213,0002,113,536
2Sep 6, 2026 10:403,52639,472,19728,263,0001,010,0002,113,536
3Sep 6, 2026 10:403,53639,432,61628,321,0001,031,0002,113,536
4Sep 6, 2026 10:403,54139,116,47228,327,0001,067,0002,113,536
5Sep 6, 2026 10:403,54439,982,09928,337,0001,085,0002,113,536
6Sep 6, 2026 10:403,55039,540,59528,441,0001,027,0002,113,536
7Sep 6, 2026 10:403,62138,420,81928,862,0001,199,0002,113,536
8Sep 6, 2026 10:403,68241,697,99229,344,0001,223,0002,113,536
9Sep 6, 2026 10:403,76441,440,64830,173,0001,076,0002,113,536