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 listMay 18, 2026 09:49Victor MerckléVictor MerckléScore: 7,795Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 09:497,78272,739,04363,563,0001,028,0002,113,536
2May 18, 2026 09:497,78675,134,62163,623,0001,007,0002,113,536
3May 18, 2026 09:497,79374,289,60063,614,0001,072,0002,113,536
4May 18, 2026 09:497,79475,366,57263,629,0001,065,0002,113,536
5May 18, 2026 09:497,79575,503,93063,648,0001,055,0002,113,536
6May 18, 2026 09:497,79674,746,65963,653,0001,061,0002,113,536
7May 18, 2026 09:497,79674,670,19963,655,0001,054,0002,113,536
8May 18, 2026 09:497,80374,071,20363,704,0001,064,0002,113,536
9May 18, 2026 09:497,80673,800,83663,734,0001,064,0002,113,536