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 25, 2026 18:51Ropi777Ropi777Score: 74,759Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 25, 2026 18:5174,660641,917,107541,718,00077,959,0002,289,664
2Feb 25, 2026 18:5174,719642,805,321552,151,00068,018,0002,383,872
3Feb 25, 2026 18:5174,739650,717,608543,294,00077,041,0002,387,968
4Feb 25, 2026 18:5174,740655,602,999551,304,00069,038,0002,273,280
5Feb 25, 2026 18:5174,759645,658,194549,557,00070,942,0002,383,872
6Feb 25, 2026 18:5174,773643,746,374552,658,00067,958,0002,379,776
7Feb 25, 2026 18:5174,792642,728,586557,797,00062,977,0002,371,584
8Feb 25, 2026 18:5174,832644,707,822558,097,00063,011,0002,383,872
9Feb 25, 2026 18:5174,955644,804,583559,114,00063,012,0002,289,664