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 17:06Victor MerckléVictor MerckléScore: 3,773Success
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 17:063,70939,065,85029,648,0001,139,0002,113,536
2Aug 27, 2026 17:063,71339,115,21229,741,0001,081,0002,113,536
3Aug 27, 2026 17:063,74139,363,02830,023,0001,029,0002,113,536
4Aug 27, 2026 17:063,77239,591,72430,131,0001,182,0002,113,536
5Aug 27, 2026 17:063,77339,613,28130,243,0001,077,0002,113,536
6Aug 27, 2026 17:063,77439,675,26230,234,0001,096,0002,113,536
7Aug 27, 2026 17:063,78139,681,45830,245,0001,138,0002,113,536
8Aug 27, 2026 17:063,78539,921,01130,220,0001,201,0002,113,536
9Aug 27, 2026 17:063,93341,025,28131,484,0001,165,0002,113,536