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 listSep 7, 2026 20:32neel-bhavsarneel-bhavsarScore: 76,232Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 20:3376,061641,355,184481,444,000149,866,00020,480
2Sep 7, 2026 20:3376,077641,692,449480,691,000150,754,00020,480
3Sep 7, 2026 20:3376,107641,809,013480,828,000150,862,00020,480
4Sep 7, 2026 20:3376,168642,462,606481,598,000150,598,00020,480
5Sep 7, 2026 20:3376,232642,620,251481,717,000151,015,00020,480
6Sep 7, 2026 20:3376,237642,737,715481,894,000150,875,00020,480
7Sep 7, 2026 20:3376,241642,841,025482,566,000150,238,00020,480
8Sep 7, 2026 20:3376,271643,817,458482,234,000150,817,00020,480
9Sep 7, 2026 20:3376,409644,234,153483,121,000151,080,00020,480