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 17, 2026 00:52Andrew EpsteinAndrew EpsteinScore: 200,394Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 00:52199,6801,667,649,3271,655,274,0002,075,0002,117,632stderr
2Sep 17, 2026 00:52200,0601,670,703,1431,658,444,0002,057,0002,117,632stderr
3Sep 17, 2026 00:52200,2001,672,139,3701,659,603,0002,061,0002,117,632stderr
4Sep 17, 2026 00:52200,2131,672,133,2261,659,659,0002,114,0002,117,632stderr
5Sep 17, 2026 00:52200,3941,673,529,8541,661,179,0002,096,0002,117,632stderr
6Sep 17, 2026 00:52200,4251,674,380,8041,661,475,0002,058,0002,117,632stderr
7Sep 17, 2026 00:52200,6561,675,626,2921,663,337,0002,109,0002,117,632stderr
8Sep 17, 2026 00:52200,9161,678,038,4031,665,541,0002,064,0002,117,632stderr
9Sep 17, 2026 00:52201,2201,680,401,8561,668,027,0002,104,0002,117,632stderr