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 16:44Adam FolwarcznyAdam FolwarcznyScore: 47,763Success
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 16:4547,719405,872,888395,064,0001,005,0002,113,536
2Jul 19, 2026 16:4547,723405,984,762394,089,0002,020,0002,113,536
3Jul 19, 2026 16:4547,740406,148,423395,244,0001,004,0002,113,536
4Jul 19, 2026 16:4547,762406,379,533394,411,0002,018,0002,113,536
5Jul 19, 2026 16:4547,763406,957,029394,415,0002,023,0002,113,536
6Jul 19, 2026 16:4547,768406,358,781394,475,0002,004,0002,113,536
7Jul 19, 2026 16:4547,785406,984,599394,615,0002,007,0002,113,536
8Jul 19, 2026 16:4547,797406,684,002394,696,0002,022,0002,113,536
9Jul 19, 2026 16:4547,798406,433,821394,683,0002,048,0002,113,536