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 09:25Victor MerckléVictor MerckléScore: 3,801Success
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 09:263,74639,307,17329,966,0001,131,0002,113,536
2Aug 27, 2026 09:263,76239,488,70430,024,0001,204,0002,113,536
3Aug 27, 2026 09:263,77639,653,86230,245,0001,098,0002,113,536
4Aug 27, 2026 09:263,78039,697,96030,191,0001,188,0002,113,536
5Aug 27, 2026 09:263,80139,812,14130,459,0001,093,0002,113,536
6Aug 27, 2026 09:263,80239,898,23530,404,0001,154,0002,113,536
7Aug 27, 2026 09:263,80839,872,25130,447,0001,167,0002,113,536
8Aug 27, 2026 09:263,82039,966,44530,618,0001,088,0002,113,536
9Aug 27, 2026 09:263,91041,528,46831,287,0001,174,0002,113,536