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 22, 2026 11:06wnwnScore: 3,467Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 11:063,43246,251,81328,489,00002,494,464
2Apr 22, 2026 11:063,44848,014,47927,599,0001,022,0002,482,176
3Apr 22, 2026 11:063,46442,261,09527,732,0001,027,0002,494,464
4Apr 22, 2026 11:063,46742,104,15126,793,0001,984,0002,306,048
5Apr 22, 2026 11:063,46742,578,12726,793,0001,984,0002,494,464
6Apr 22, 2026 11:063,51547,965,96328,170,0001,006,0002,486,272
7Apr 22, 2026 11:063,53744,725,86528,348,0001,012,0002,490,368
8Apr 22, 2026 11:063,54947,515,47928,442,0001,015,0002,482,176
9Apr 22, 2026 11:063,57448,957,40429,667,00002,482,176