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 13:32Rajarshi BasuRajarshi BasuScore: 8,593Success
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 13:328,411102,128,87567,821,0001,994,0002,289,664
2Dec 4, 2025 13:328,42795,944,01967,947,0001,998,0002,494,464
3Dec 4, 2025 13:328,455100,153,20068,171,0002,005,0002,289,664
4Dec 4, 2025 13:328,59392,302,43070,318,0001,004,0002,289,664
5Dec 4, 2025 13:328,59599,425,03569,328,0002,009,0002,494,464
6Dec 4, 2025 13:328,66196,677,88370,890,000998,0002,498,560