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 15:48wnwnScore: 3,306Success
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 15:493,29335,038,79326,332,0001,003,0002,113,536
2May 11, 2026 15:493,30136,681,14527,403,00002,113,536
3May 11, 2026 15:493,30135,097,45527,405,00002,113,536
4May 11, 2026 15:493,30335,507,66527,415,00002,113,536
5May 11, 2026 15:493,30636,585,34427,448,00002,113,536
6May 11, 2026 15:493,31035,006,83026,447,0001,031,0002,113,536
7May 11, 2026 15:493,44137,738,85827,466,0001,102,0002,113,536
8May 11, 2026 15:493,47335,968,43928,833,00002,113,536
9May 11, 2026 15:493,48037,008,76427,871,0001,014,0002,113,536