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 17:13Adam FolwarcznyAdam FolwarcznyScore: 20,962Success
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 17:1320,739181,927,554170,931,0001,206,0002,113,536
2Jul 19, 2026 17:1320,743181,982,782170,977,0001,193,0002,113,536
3Jul 19, 2026 17:1320,759182,127,308171,295,0001,005,0002,113,536
4Jul 19, 2026 17:1320,766182,172,580171,358,0001,006,0002,113,536
5Jul 19, 2026 17:1320,962183,884,410172,930,0001,056,0002,113,536
6Jul 19, 2026 17:1321,021184,366,506173,204,0001,277,0002,113,536
7Jul 19, 2026 17:1321,056184,522,763173,676,0001,092,0002,113,536
8Jul 19, 2026 17:1321,433188,322,387176,893,0001,008,0002,113,536
9Jul 19, 2026 17:1321,701189,994,070178,870,0001,256,0002,113,536