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 listAug 2, 2026 07:07Andrey TsvetkovAndrey TsvetkovScore: 40,438Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 07:0940,409347,074,741333,240,0002,159,0002,138,112
2Aug 2, 2026 07:0940,420346,774,850333,333,0002,159,0002,138,112
3Aug 2, 2026 07:0940,420346,680,277333,327,0002,160,0002,138,112
4Aug 2, 2026 07:0940,437346,364,103333,484,0002,147,0002,138,112
5Aug 2, 2026 07:0940,438347,053,778333,467,0002,169,0002,138,112
6Aug 2, 2026 07:0940,439347,250,963333,469,0002,182,0002,138,112
7Aug 2, 2026 07:0940,444348,589,515332,437,0003,251,0002,138,112
8Aug 2, 2026 07:0940,448347,259,060333,510,0002,215,0002,138,112
9Aug 2, 2026 07:0940,449346,946,491333,561,0002,169,0002,138,112