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 listApr 12, 2026 16:39Josu San MartinJosu San MartinScore: 5,396Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 12, 2026 16:425,08469,909,80140,192,0002,009,0002,297,856
2Apr 12, 2026 16:425,13170,202,59240,562,0002,028,0002,486,272
3Apr 12, 2026 16:395,15172,652,17940,769,0001,988,0002,486,272
4Apr 12, 2026 16:455,16668,345,00340,834,0002,041,0002,289,664
5Apr 12, 2026 16:455,39673,824,18441,803,0002,985,0002,478,080
6Apr 12, 2026 16:425,40174,480,63141,840,0002,988,0002,490,368
7Apr 12, 2026 16:455,41271,056,49041,928,0002,994,0002,297,856
8Apr 12, 2026 16:395,46666,586,22842,344,0003,024,0002,482,176
9Apr 12, 2026 16:395,46668,202,97644,362,0001,008,0002,289,664