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 listApr 26, 2026 17:53Charles CabergsCharles CabergsScore: 13,533Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 17:5413,151124,422,235107,153,0002,002,0002,367,488
2Apr 26, 2026 17:5413,163127,790,358108,259,0001,002,0002,297,856
3Apr 26, 2026 17:5413,244132,191,718107,933,0001,998,0002,375,680
4Apr 26, 2026 17:5413,533128,131,281111,323,0001,002,0002,310,144
5Apr 26, 2026 17:5413,533126,463,536111,324,0001,002,0002,301,952
6Apr 26, 2026 17:5413,538130,504,174112,368,00002,375,680
7Apr 26, 2026 17:5413,540130,200,341111,386,0001,003,0002,359,296
8Apr 26, 2026 17:5413,542131,363,212111,401,0001,003,0002,375,680
9Apr 26, 2026 17:5413,556129,690,621111,512,0001,004,0002,306,048