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 15, 2026 12:16Tomislav TunkovicTomislav TunkovicScore: 4,834Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 12:164,83049,214,04039,051,0001,038,0002,117,632
2Aug 15, 2026 12:164,83149,280,25339,063,0001,040,0002,117,632
3Aug 15, 2026 12:164,83248,536,03639,067,0001,040,0002,117,632
4Aug 15, 2026 12:164,83348,605,22239,080,0001,037,0002,117,632
5Aug 15, 2026 12:164,83448,553,23839,090,0001,037,0002,117,632
6Aug 15, 2026 12:164,83549,253,85339,094,0001,039,0002,117,632
7Aug 15, 2026 12:164,83949,306,48339,129,0001,038,0002,117,632
8Aug 15, 2026 12:164,84249,302,77339,151,0001,038,0002,117,632
9Aug 15, 2026 12:164,84349,352,02039,168,0001,037,0002,117,632