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 listJul 29, 2024 13:46darksidersstrifedarksidersstrifeScore: 95,182Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 29, 2024 13:4495,140851,538,792789,658,17402,260,992
2Jul 29, 2024 13:4495,149850,585,165789,733,89702,269,184
3Jul 29, 2024 13:4495,163844,613,821789,855,86102,260,992
4Jul 29, 2024 13:4695,163856,467,868789,852,24102,265,088
5Jul 29, 2024 13:4695,182848,812,453790,014,48502,265,088
6Jul 29, 2024 13:4695,271863,924,206790,746,29002,260,992
7Jul 29, 2024 13:4695,591853,671,250793,401,74302,256,896
8Jul 29, 2024 13:4695,814860,482,130795,254,72502,265,088
9Jul 29, 2024 13:4695,967865,131,452796,526,08402,260,992