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 3, 2026 05:14limanjun99limanjun99Score: 5,504Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 05:145,44265,176,40641,157,0004,015,0002,412,544
2May 3, 2026 05:145,44863,465,05739,192,0006,029,0002,420,736
3May 3, 2026 05:145,46264,697,13641,311,0004,030,0002,412,544
4May 3, 2026 05:145,49163,172,10541,526,0004,051,0002,527,232
5May 3, 2026 05:145,50463,385,55039,730,0005,959,0002,424,832
6May 3, 2026 05:145,50467,266,02239,731,0005,959,0002,420,736
7May 3, 2026 05:145,55767,957,53041,116,0005,014,0002,420,736
8May 3, 2026 05:145,57264,585,33341,223,0005,027,0002,416,640
9May 3, 2026 05:145,59463,493,26542,399,0004,038,0002,424,832