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 28, 2026 19:56wnwnScore: 4,438Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 28, 2026 19:564,38361,511,63935,366,0001,010,0002,277,376
2Feb 28, 2026 19:564,38566,299,89535,385,0001,011,0002,277,376
3Feb 28, 2026 19:564,40468,348,04635,539,0001,015,0002,494,464
4Feb 28, 2026 19:564,43867,681,71734,848,0001,991,0002,490,368
5Feb 28, 2026 19:564,48756,976,94035,226,0002,012,0002,277,376
6Feb 28, 2026 19:564,48959,300,51635,245,0002,014,0002,277,376