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 29, 2025 06:20Josu San MartinJosu San MartinScore: 59,832Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2025 06:2059,793524,267,662268,612,000227,671,0002,449,408
2Dec 29, 2025 06:2059,832526,573,211268,787,000227,820,0002,318,336
3Dec 29, 2025 06:2059,969521,166,637270,858,000226,881,0002,363,392