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:52Victor MerckléVictor MerckléScore: 7,742Success
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:537,68672,879,08962,608,0001,186,0002,113,536
2Aug 27, 2026 17:537,72173,195,18562,877,0001,214,0002,113,536
3Aug 27, 2026 17:537,73072,595,34062,947,0001,213,0002,113,536
4Aug 27, 2026 17:537,73972,698,49063,040,0001,200,0002,113,536
5Aug 27, 2026 17:537,74272,754,45863,061,0001,201,0002,113,536
6Aug 27, 2026 17:537,75072,758,65063,103,0001,229,0002,113,536
7Aug 27, 2026 17:537,75673,463,28963,158,0001,222,0002,113,536
8Aug 27, 2026 17:537,76072,887,91663,220,0001,194,0002,113,536
9Aug 27, 2026 17:537,78773,010,79263,444,0001,193,0002,113,536