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 28, 2026 16:01Victor MerckléVictor MerckléScore: 4,004Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 16:023,79740,627,80730,422,0001,094,0002,113,536
2Aug 28, 2026 16:023,80639,748,77730,460,0001,135,0002,113,536
3Aug 28, 2026 16:023,84640,031,66530,807,0001,118,0002,113,536
4Aug 28, 2026 16:023,97642,697,18131,940,0001,062,0002,113,536
5Aug 28, 2026 16:024,00441,380,92232,158,0001,076,0002,113,536
6Aug 28, 2026 16:024,00642,302,28832,204,0001,051,0002,113,536
7Aug 28, 2026 16:024,03441,832,99132,435,0001,051,0002,113,536
8Aug 28, 2026 16:024,08642,439,54832,859,0001,062,0002,113,536
9Aug 28, 2026 16:024,10142,440,96332,983,0001,058,0002,113,536