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 listFeb 15, 2026 22:28wnwnScore: 9,684Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 22:288,49595,409,69160,438,00010,073,0002,351,104
2Feb 15, 2026 22:288,563100,294,06261,065,00010,010,0002,396,160
3Feb 15, 2026 22:288,60295,405,21864,356,0007,039,0002,461,696
4Feb 15, 2026 22:289,684106,903,03672,343,0008,038,0002,297,856
5Feb 15, 2026 22:289,735107,911,22272,817,0007,980,0002,482,176
6Feb 15, 2026 22:289,761103,864,70572,016,0009,002,0002,461,696