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 01:25Josu San MartinJosu San MartinScore: 5,709Success
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 01:255,54060,387,54244,891,0001,092,0002,478,080
2May 10, 2026 01:255,56062,068,76644,947,0001,201,0002,469,888
3May 10, 2026 01:255,58163,002,11545,151,0001,176,0002,482,176
4May 10, 2026 01:255,59459,071,30645,245,0001,190,0002,469,888
5May 10, 2026 01:255,70961,761,20146,326,0001,060,0002,482,176
6May 10, 2026 01:255,72863,052,66846,364,0001,181,0002,482,176
7May 10, 2026 01:255,91965,798,51647,958,0001,172,0002,478,080
8May 10, 2026 01:255,94665,995,43048,190,0001,164,0002,469,888
9May 10, 2026 01:255,97364,716,97248,368,0001,208,0002,465,792