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 listAug 17, 2026 22:06Josu San MartinJosu San MartinScore: 4,951Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 22:094,93549,014,04439,853,0001,111,0002,113,536
2Aug 17, 2026 22:094,93749,606,28939,867,0001,116,0002,113,536
3Aug 17, 2026 22:094,94150,589,65139,911,0001,101,0002,113,536
4Aug 17, 2026 22:094,94449,226,89639,927,0001,109,0002,113,536
5Aug 17, 2026 22:094,95149,293,18040,007,0001,092,0002,113,536
6Aug 17, 2026 22:094,95349,348,82440,016,0001,096,0002,113,536
7Aug 17, 2026 22:094,95749,163,88740,042,0001,105,0002,113,536
8Aug 17, 2026 22:094,95749,341,34840,136,0001,009,0002,113,536
9Aug 17, 2026 22:094,95849,456,66440,056,0001,102,0002,113,536