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 5, 2026 16:25M-RochatM-RochatScore: 20,173Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 16:2520,090182,046,117165,622,0001,131,0002,473,984
2May 5, 2026 16:2520,100181,578,794165,688,0001,150,0002,473,984
3May 5, 2026 16:2520,113182,682,046165,772,0001,174,0002,469,888
4May 5, 2026 16:2520,140184,571,999166,035,0001,135,0002,469,888
5May 5, 2026 16:2520,173184,141,786166,272,0001,170,0002,478,080
6May 5, 2026 16:2520,192184,457,334166,458,0001,140,0002,469,888
7May 5, 2026 16:2520,204184,972,946166,520,0001,174,0002,469,888
8May 5, 2026 16:2520,215181,374,972166,636,0001,156,0002,469,888
9May 5, 2026 16:2520,335182,309,203167,660,0001,126,0002,478,080