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 2, 2026 18:55Josu San MartinJosu San MartinScore: 9,783Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 18:559,558104,223,74678,330,0001,004,0002,265,088
2Jan 2, 2026 18:559,568102,463,85278,409,0001,005,0002,265,088
3Jan 2, 2026 18:559,612108,326,76978,786,000997,0002,527,232
4Jan 2, 2026 18:559,783104,581,60881,203,00002,260,992
5Jan 2, 2026 18:559,788102,018,80380,239,0001,002,0002,367,488
6Jan 2, 2026 18:559,867106,601,37880,894,000998,0002,351,104