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 5, 2026 17:47Kevin HeaveyKevin HeaveyScore: 5,234Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 17:475,18752,502,06741,929,0001,131,0002,117,632
2Jul 5, 2026 17:475,20052,672,69642,018,0001,144,0002,117,632
3Jul 5, 2026 17:475,21152,796,09242,013,0001,240,0002,117,632
4Jul 5, 2026 17:475,22052,842,31042,139,0001,192,0002,117,632
5Jul 5, 2026 17:475,23452,907,95542,316,0001,133,0002,117,632
6Jul 5, 2026 17:475,23453,058,68742,282,0001,165,0002,117,632
7Jul 5, 2026 17:475,24753,117,73042,391,0001,160,0002,117,632
8Jul 5, 2026 17:475,26753,298,03242,569,0001,150,0002,117,632
9Jul 5, 2026 17:475,27453,343,88442,554,0001,225,0002,117,632