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 listFeb 15, 2026 18:52Daniel MastalerzDaniel MastalerzScore: 6,391Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 18:526,28778,959,81348,170,0004,014,0002,310,144
2Feb 15, 2026 18:526,31374,959,97848,364,0004,030,0002,310,144
3Feb 15, 2026 18:526,31874,425,80448,408,0004,034,0002,359,296
4Feb 15, 2026 18:526,39177,509,75050,040,0003,002,0002,265,088
5Feb 15, 2026 18:526,39678,905,22449,080,0004,006,0002,273,280
6Feb 15, 2026 18:526,39677,920,34650,081,0003,004,0002,306,048