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 8, 2026 19:29Mikołaj UzarskiMikołaj UzarskiScore: 10,650Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 8, 2026 19:3010,583109,725,95569,870,00017,966,0002,281,472
2Feb 8, 2026 19:3010,585114,191,73670,885,00016,972,0002,273,280
3Feb 8, 2026 19:3010,598116,671,76869,971,00017,992,0002,404,352
4Feb 8, 2026 19:3010,637116,308,23971,427,00016,864,0002,281,472
5Feb 8, 2026 19:3010,650116,196,52472,501,00015,890,0002,510,848
6Feb 8, 2026 19:3010,659112,863,89863,621,00024,852,0002,527,232
7Feb 8, 2026 19:3010,660114,644,19867,599,00020,876,0002,510,848
8Feb 8, 2026 19:3010,674119,894,98073,664,00014,931,0002,465,792
9Feb 8, 2026 19:3010,686114,526,13666,771,00021,924,0002,387,968