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 19:06Josu San MartinJosu San MartinScore: 5,197Success
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 19:065,08364,723,35540,177,0002,008,0002,297,856
2Apr 12, 2026 19:025,15875,601,45639,827,0002,987,0002,297,856
3Apr 12, 2026 19:045,16069,599,29139,840,0002,988,0002,289,664
4Apr 12, 2026 19:025,18070,662,65040,991,0001,999,0002,297,856
5Apr 12, 2026 19:025,19767,087,03940,130,0003,009,0002,486,272
6Apr 12, 2026 19:045,22869,986,42841,374,0002,018,0002,289,664
7Apr 12, 2026 19:065,41166,761,56341,921,0002,994,0002,297,856
8Apr 12, 2026 19:065,41566,509,66641,952,0002,996,0002,510,848
9Apr 12, 2026 19:045,47472,045,83445,436,00002,486,272