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 23, 2026 22:37Maya RebholzMaya RebholzScore: 8,353Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 23, 2026 22:388,28580,281,67063,219,0005,552,0002,113,536
2May 23, 2026 22:388,30581,437,10763,277,0005,660,0002,117,632
3May 23, 2026 22:388,31780,448,04763,344,0005,690,0002,117,632
4May 23, 2026 22:388,32979,042,42063,411,0005,724,0002,113,536
5May 23, 2026 22:388,35379,517,96163,757,0005,579,0002,117,632
6May 23, 2026 22:388,36180,000,78763,960,0005,437,0002,117,632
7May 23, 2026 22:388,39981,758,09164,012,0005,702,0002,117,632
8May 23, 2026 22:388,40281,718,37163,961,0005,782,0002,117,632
9May 23, 2026 22:388,40379,706,74264,015,0005,736,0002,113,536