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 listNov 1, 2026 18:54Dinu GoyalDinu GoyalScore: 92,356Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 1, 2026 18:5488,793747,616,962735,823,0001,161,0002,113,536
2Nov 1, 2026 18:5489,771756,098,620739,293,0005,813,00020,480
3Nov 1, 2026 18:5491,611771,497,883759,374,0001,001,0002,113,536
4Nov 1, 2026 18:5492,095774,994,458763,386,0001,004,0002,113,536
5Nov 1, 2026 18:5492,356777,294,872755,670,00010,885,00020,480
6Nov 1, 2026 18:5492,368777,986,986760,946,0005,714,00020,480
7Nov 1, 2026 18:5492,641780,193,940763,134,0005,790,00020,480
8Nov 1, 2026 18:5493,598788,054,517763,194,00013,673,0002,113,536
9Nov 1, 2026 18:5493,759788,900,895763,553,00014,654,00020,480