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 18, 2026 18:51Adam FolwarcznyAdam FolwarcznyScore: 62,036Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2026 18:5261,685523,134,642509,871,0002,120,0002,113,536
2Jul 18, 2026 18:5261,698522,618,422510,085,0002,009,0002,113,536
3Jul 18, 2026 18:5262,003524,459,144513,624,0001,003,0002,113,536
4Jul 18, 2026 18:5262,028525,326,414512,800,0002,033,0002,113,536
5Jul 18, 2026 18:5262,036525,413,121512,876,0002,029,0002,113,536
6Jul 18, 2026 18:5262,038525,413,325512,869,0002,050,0002,113,536
7Jul 18, 2026 18:5262,044525,500,750512,961,0002,011,0002,113,536
8Jul 18, 2026 18:5262,046525,078,977512,978,0002,005,0002,113,536
9Jul 18, 2026 18:5262,056525,187,133513,044,0002,024,0002,113,536