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 listApr 24, 2026 14:03Charles CabergsCharles CabergsScore: 21,098Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 14:0320,338186,140,037166,812,0001,997,0002,314,240
2Apr 24, 2026 14:0320,338184,734,586166,813,0001,997,0002,306,048
3Apr 24, 2026 14:0320,544189,724,159169,518,0001,003,0002,371,584
4Apr 24, 2026 14:0321,092195,566,424173,065,0002,000,0002,371,584
5Apr 24, 2026 14:0321,098194,318,618174,119,0001,000,0002,371,584
6Apr 24, 2026 14:0321,110191,749,720174,214,0001,001,0002,379,776
7Apr 24, 2026 14:0321,112188,713,693173,232,0002,002,0002,441,216
8Apr 24, 2026 14:0321,113192,247,822174,245,0001,001,0002,363,392
9Apr 24, 2026 14:0321,117194,900,449174,278,0001,001,0002,371,584