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 14:02Rajarshi BasuRajarshi BasuScore: 9,034Success
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 14:028,85898,466,36272,511,0001,007,0002,289,664
2Dec 4, 2025 14:028,859100,356,71972,523,0001,007,0002,502,656
3Dec 4, 2025 14:028,994104,503,03873,641,0001,008,0002,289,664
4Dec 4, 2025 14:029,034100,017,63372,983,0001,999,0002,486,272
5Dec 4, 2025 14:029,183102,881,19374,215,0002,005,0002,289,664
6Dec 4, 2025 14:029,238103,035,62776,672,00002,289,664