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 listSep 7, 2026 21:28Sai PutravuSai PutravuScore: 69,785Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 21:2869,737590,510,405575,305,0003,514,00020,480
2Sep 7, 2026 21:2869,763589,087,993575,363,0003,676,00020,480
3Sep 7, 2026 21:2869,770589,085,663575,601,0003,497,00020,480
4Sep 7, 2026 21:2869,777589,183,855575,558,0003,592,00020,480
5Sep 7, 2026 21:2869,785589,314,538575,337,0003,880,00020,480
6Sep 7, 2026 21:2869,820589,505,059575,525,0003,985,00020,480
7Sep 7, 2026 21:2869,833589,623,516575,461,0004,153,00020,480
8Sep 7, 2026 21:2869,837589,659,613575,493,0004,160,0002,113,536
9Sep 7, 2026 21:2869,838589,800,629575,515,0004,144,00020,480