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 07:03Josu San MartinJosu San MartinError
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 07:04050,241,94733,184,0001,134,0002,482,176expected "53680679921905803 ", got "53680679866545392 "
2May 10, 2026 07:04050,867,18032,891,0001,122,0002,486,272expected "53679246679815811 ", got "53679246359961656 "
3May 10, 2026 07:044,10648,511,48632,978,0001,108,0002,482,176
4May 10, 2026 07:044,10751,935,78532,939,0001,150,0002,486,272
5May 10, 2026 07:044,11349,996,04033,020,0001,123,0002,490,368
6May 10, 2026 07:044,12347,308,92733,115,0001,114,0002,478,080
7May 10, 2026 07:044,13047,466,70433,160,0001,124,0002,482,176
8May 10, 2026 07:044,13248,229,33033,171,0001,128,0002,482,176
9May 10, 2026 07:044,13652,511,19033,217,0001,118,0002,482,176