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 27, 2026 02:00Victor MerckléVictor MerckléScore: 8,056Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 02:018,04575,024,24965,736,0001,044,0002,113,536
2Aug 27, 2026 02:018,05075,049,84665,763,0001,054,0002,113,536
3Aug 27, 2026 02:018,05274,962,85065,786,0001,046,0002,113,536
4Aug 27, 2026 02:018,05475,136,79565,821,0001,032,0002,113,536
5Aug 27, 2026 02:018,05675,102,30465,823,0001,047,0002,113,536
6Aug 27, 2026 02:018,05775,079,74865,836,0001,041,0002,113,536
7Aug 27, 2026 02:018,06376,520,88165,865,0001,066,0002,113,536
8Aug 27, 2026 02:018,06375,071,28565,884,0001,047,0002,113,536
9Aug 27, 2026 02:018,06475,067,33865,887,0001,048,0002,113,536