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 24, 2026 17:10Victor MerckléVictor MerckléScore: 5,741Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 17:115,73057,370,04946,499,0001,063,0002,113,536
2May 24, 2026 17:115,73355,397,14846,521,0001,066,0002,113,536
3May 24, 2026 17:115,73756,233,11246,557,0001,068,0002,113,536
4May 24, 2026 17:115,74056,001,55246,583,0001,065,0002,113,536
5May 24, 2026 17:115,74157,067,20746,589,0001,065,0002,113,536
6May 24, 2026 17:115,76257,230,00246,802,0001,028,0002,113,536
7May 24, 2026 17:115,78256,544,33546,960,0001,037,0002,113,536
8May 24, 2026 17:115,78658,032,16147,004,0001,028,0002,113,536
9May 24, 2026 17:115,96658,978,06448,451,0001,070,0002,113,536