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 listFeb 23, 2026 21:25Daniel MastalerzDaniel MastalerzScore: 5,578Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 23, 2026 21:255,55971,053,05244,136,0002,006,0002,285,568
2Feb 23, 2026 21:255,55970,599,64544,134,0002,006,0002,506,752
3Feb 23, 2026 21:255,56571,812,38244,184,0002,008,0002,285,568
4Feb 23, 2026 21:255,56669,198,14244,188,0002,008,0002,285,568
5Feb 23, 2026 21:255,57873,150,39845,291,0001,006,0002,277,376
6Feb 23, 2026 21:255,58068,434,24745,312,0001,006,0002,502,656
7Feb 23, 2026 21:255,68274,974,57946,159,0001,003,0002,277,376
8Feb 23, 2026 21:255,68969,373,34246,214,0001,004,0002,281,472
9Feb 23, 2026 21:255,69972,179,86745,292,0002,013,0002,281,472