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 9, 2026 14:23wnwnScore: 3,407Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 14:233,37643,822,01926,972,0001,050,0002,486,272
2May 9, 2026 14:233,38044,421,55426,986,0001,071,0002,482,176
3May 9, 2026 14:233,39044,140,28127,092,0001,049,0002,498,560
4May 9, 2026 14:233,40343,253,43427,190,0001,060,0002,482,176
5May 9, 2026 14:233,40744,531,23427,216,0001,068,0002,482,176
6May 9, 2026 14:233,49043,780,59127,905,0001,062,0002,482,176
7May 9, 2026 14:233,53445,034,68128,268,0001,068,0002,486,272
8May 9, 2026 14:233,54945,860,69028,365,0001,093,0002,494,464
9May 9, 2026 14:233,57246,362,37428,532,0001,122,0002,482,176