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 6, 2025 08:44Rajarshi BasuRajarshi BasuScore: 14,392Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 6, 2025 08:4414,386154,576,952104,351,00015,050,0002,449,408
2Dec 6, 2025 08:4414,392146,558,407106,406,00013,049,0002,469,888
3Dec 6, 2025 08:4414,450154,845,441106,943,00012,993,0002,265,088