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 listDec 4, 2025 18:17Rajarshi BasuRajarshi BasuScore: 8,817Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 4, 2025 18:178,65197,699,31669,811,0001,994,0002,490,368
2Dec 4, 2025 18:178,671101,180,31568,971,0002,998,0002,289,664
3Dec 4, 2025 18:178,68499,737,39270,075,0002,002,0002,289,664
4Dec 4, 2025 18:178,81794,728,63472,175,0001,002,0002,289,664
5Dec 4, 2025 18:178,854100,238,87673,491,00002,289,664
6Dec 4, 2025 18:178,96694,727,56672,404,0002,011,0002,289,664