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 11, 2026 06:46wnwnScore: 3,422Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 06:473,27634,786,89027,193,00002,113,536
2May 11, 2026 06:473,30836,579,95426,456,0001,003,0002,113,536
3May 11, 2026 06:473,31137,745,02927,482,00002,113,536
4May 11, 2026 06:473,41838,011,61228,374,00002,113,536
5May 11, 2026 06:473,42237,821,97127,394,0001,011,0002,113,536
6May 11, 2026 06:473,42535,965,04228,430,00002,113,536
7May 11, 2026 06:473,43937,924,22028,546,00002,113,536
8May 11, 2026 06:473,45638,548,87628,691,00002,113,536
9May 11, 2026 06:473,45738,436,40628,700,00002,113,536