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 listJan 11, 2026 15:41Pavel SkripkinPavel SkripkinScore: 37,731Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2026 15:4137,724335,911,539312,111,0001,000,0002,281,472
2Jan 11, 2026 15:4137,731333,100,935313,164,00002,424,832
3Jan 11, 2026 15:4137,737337,890,176312,219,0001,000,0002,441,216