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 listSep 3, 2026 17:04Victor MerckléVictor MerckléScore: 4,821Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 17:054,69347,427,33137,911,0001,045,0002,113,536
2Sep 3, 2026 17:054,71047,537,35738,045,0001,056,0002,113,536
3Sep 3, 2026 17:054,79048,930,13038,648,0001,115,0002,113,536
4Sep 3, 2026 17:054,81049,085,49138,819,0001,106,0002,113,536
5Sep 3, 2026 17:054,82148,575,86038,889,0001,128,0002,113,536
6Sep 3, 2026 17:054,82648,492,36439,028,0001,028,0002,113,536
7Sep 3, 2026 17:054,83848,581,34139,112,0001,045,0002,113,536
8Sep 3, 2026 17:054,91250,160,54239,656,0001,119,0002,113,536
9Sep 3, 2026 17:054,92850,045,22339,842,0001,064,0002,113,536