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 listJul 19, 2026 18:21Adam FolwarcznyAdam FolwarcznyScore: 11,649Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 19, 2026 18:2211,481103,456,05682,248,00013,048,0002,117,632
2Jul 19, 2026 18:2211,607104,433,84183,220,00013,119,0002,117,632
3Jul 19, 2026 18:2211,624104,633,58483,556,00012,927,0002,117,632
4Jul 19, 2026 18:2211,643104,771,92283,342,00013,296,0002,117,632
5Jul 19, 2026 18:2211,649104,653,61684,219,00012,471,0002,117,632
6Jul 19, 2026 18:2211,673105,129,59783,670,00013,222,0002,117,632
7Jul 19, 2026 18:2211,734106,097,10484,160,00013,233,0002,117,632
8Jul 19, 2026 18:2211,848106,532,55886,120,00012,220,0002,117,632
9Jul 19, 2026 18:2212,019107,920,39786,551,00013,209,0002,117,632