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 listAug 22, 2025 14:52Gjorgji KjosevGjorgji KjosevScore: 81,389Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 22, 2025 14:5281,267701,777,075601,568,00072,947,0002,289,664
2Aug 22, 2025 14:5281,273699,754,989613,603,00060,960,0002,351,104
3Aug 22, 2025 14:5281,279700,971,123619,645,00054,968,0002,285,568
4Aug 22, 2025 14:5281,296704,071,004596,787,00077,972,0002,285,568
5Aug 22, 2025 14:5281,389701,657,734593,585,00081,942,0002,285,568
6Aug 22, 2025 14:5281,395702,256,377624,612,00050,968,0002,281,472
7Aug 22, 2025 14:5281,433702,154,789603,902,00071,988,0002,351,104
8Aug 22, 2025 14:5281,577703,922,068611,082,00066,008,0002,363,392
9Aug 22, 2025 14:5282,073707,855,918616,190,00065,020,0002,355,200