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 10, 2026 14:01Josu San MartinJosu San MartinScore: 4,606Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 14:024,59447,327,61537,087,0001,044,0002,113,536
2May 10, 2026 14:024,59446,119,27937,098,0001,040,0002,113,536
3May 10, 2026 14:024,59847,056,72637,119,0001,046,0002,113,536
4May 10, 2026 14:024,59947,770,43037,126,0001,052,0002,113,536
5May 10, 2026 14:024,60647,483,18037,203,0001,031,0002,113,536
6May 10, 2026 14:024,60847,438,13437,193,0001,054,0002,113,536
7May 10, 2026 14:024,61347,336,63837,264,0001,032,0002,113,536
8May 10, 2026 14:024,62145,642,10437,322,0001,040,0002,113,536
9May 10, 2026 14:024,78148,532,55138,646,0001,040,0002,113,536