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 listMay 10, 2026 14:09Josu San MartinJosu San MartinScore: 4,183Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 14:094,16343,754,78333,526,0001,033,0002,113,536
2May 10, 2026 14:094,16942,029,62833,569,0001,037,0002,113,536
3May 10, 2026 14:094,17241,847,75133,586,0001,043,0002,113,536
4May 10, 2026 14:094,17643,992,68733,633,0001,031,0002,113,536
5May 10, 2026 14:094,18343,585,65733,667,0001,052,0002,113,536
6May 10, 2026 14:094,18547,092,96633,676,0001,060,0002,113,536
7May 10, 2026 14:094,19142,026,35533,760,0001,029,0002,113,536
8May 10, 2026 14:094,19642,473,84433,787,0001,045,0002,113,536
9May 10, 2026 14:094,22743,791,03334,035,0001,057,0002,113,536