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 listMar 15, 2026 16:29shartgepettoshartgepettoScore: 8,030Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 16:297,99193,999,44562,304,0004,019,0002,461,696
2Mar 15, 2026 16:298,01089,848,91264,471,0002,014,0002,412,544
3Mar 15, 2026 16:298,01690,601,45663,510,0003,024,0002,486,272
4Mar 15, 2026 16:298,01793,415,97062,511,0004,033,0002,351,104
5Mar 15, 2026 16:298,03090,601,05462,609,0004,039,0002,330,624
6Mar 15, 2026 16:298,03992,715,00062,740,0003,983,0002,416,640
7Mar 15, 2026 16:298,06989,307,60663,974,0002,998,0002,420,736
8Mar 15, 2026 16:298,07390,165,09963,005,0004,000,0002,273,280
9Mar 15, 2026 16:298,13595,236,15064,501,0003,023,0002,367,488