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 listJan 30, 2026 02:40Josu San MartinJosu San MartinScore: 6,137Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 30, 2026 02:405,76671,671,25645,863,0001,994,0002,441,216
2Jan 30, 2026 02:406,00871,519,62247,875,0001,994,0002,437,120
3Jan 30, 2026 02:406,12273,932,46549,817,000996,0002,441,216
4Jan 30, 2026 02:406,13775,520,69948,944,0001,997,0002,273,280
5Jan 30, 2026 02:406,22076,491,87150,617,0001,012,0002,527,232
6Jan 30, 2026 02:406,24079,524,12950,799,000996,0002,285,568