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 listJun 28, 2026 07:29Shikhar SoniShikhar SoniScore: 10,908Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 07:3010,79299,156,64682,410,0007,169,0002,121,728
2Jun 28, 2026 07:3010,851100,076,59382,783,0007,284,0002,121,728
3Jun 28, 2026 07:3010,85599,567,37983,082,0007,016,0002,117,632
4Jun 28, 2026 07:3010,888100,232,36383,172,0007,204,0002,117,632
5Jun 28, 2026 07:3010,908100,445,76983,328,0007,216,0002,121,728
6Jun 28, 2026 07:3010,917100,104,96783,468,0007,145,0002,125,824
7Jun 28, 2026 07:3010,917100,533,65183,427,0007,189,0002,121,728
8Jun 28, 2026 07:3010,929100,572,28383,434,0007,283,0002,117,632
9Jun 28, 2026 07:3010,940100,676,44183,396,0007,413,0002,117,632