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 19, 2026 22:46Pavel KrajcevskiPavel KrajcevskiScore: 89,157Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 22:4789,114749,149,216738,645,0001,004,0002,113,536
2May 19, 2026 22:4789,128749,094,339738,764,0001,002,0002,113,536
3May 19, 2026 22:4789,131750,578,361738,790,0001,003,0002,113,536
4May 19, 2026 22:4789,137750,757,430738,839,0001,003,0002,113,536
5May 19, 2026 22:4789,157749,258,379738,983,0001,026,0002,113,536
6May 19, 2026 22:4789,161750,170,856739,040,0001,004,0002,113,536
7May 19, 2026 22:4789,161751,638,340739,042,0001,002,0002,113,536
8May 19, 2026 22:4789,170751,840,244739,114,0001,003,0002,113,536
9May 19, 2026 22:4789,196750,290,762739,329,0001,002,0002,113,536