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 20, 2025 07:33sheryllynn24sheryllynn24Score: 12,775Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 20, 2025 07:3312,678130,264,816103,226,0002,004,0002,285,568
2Sep 20, 2025 07:3312,726132,192,163105,623,00002,285,568
3Sep 20, 2025 07:3312,731136,554,452104,663,0001,006,0002,285,568
4Sep 20, 2025 07:3312,772132,533,028105,009,0001,000,0002,273,280
5Sep 20, 2025 07:3312,775134,303,089104,033,0002,000,0002,285,568
6Sep 20, 2025 07:3312,792130,396,970104,167,0002,003,0002,260,992
7Sep 20, 2025 07:3312,816129,241,966104,369,0002,007,0002,285,568
8Sep 20, 2025 07:3312,891138,405,416106,995,00002,506,752
9Sep 20, 2025 07:3312,948128,227,572106,467,0001,004,0002,392,064