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 4, 2026 00:45Josu San MartinJosu San MartinScore: 5,550Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 00:455,38153,964,82141,592,0003,076,0002,113,536
2Jul 4, 2026 00:455,41854,343,34841,754,0003,217,0002,113,536
3Jul 4, 2026 00:455,46554,712,89542,096,0003,267,0002,113,536
4Jul 4, 2026 00:455,48656,578,97642,478,0003,058,0002,113,536
5Jul 4, 2026 00:455,55055,498,01042,835,0003,233,0002,113,536
6Jul 4, 2026 00:455,63956,230,49743,501,0003,307,0002,113,536
7Jul 4, 2026 00:455,80057,501,89144,841,0003,305,0002,113,536
8Jul 4, 2026 00:456,63564,480,85951,812,0003,264,0002,113,536
9Jul 4, 2026 00:456,68865,055,87752,276,0003,239,0002,113,536