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 3, 2026 13:20Alexander StanovoyAlexander StanovoyScore: 60,712Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 13:2160,693513,266,934502,656,0001,102,0002,113,536
2Jul 3, 2026 13:2160,695513,339,532502,655,0001,114,0002,113,536
3Jul 3, 2026 13:2160,709513,439,906502,779,0001,111,0002,113,536
4Jul 3, 2026 13:2160,711513,814,207502,721,0001,182,0002,113,536
5Jul 3, 2026 13:2160,712513,574,021502,740,0001,172,0002,113,536
6Jul 3, 2026 13:2160,714513,492,176502,905,0001,022,0002,113,536
7Jul 3, 2026 13:2160,717514,112,850502,689,0001,267,0002,113,536
8Jul 3, 2026 13:2160,734514,108,567502,910,0001,183,0002,113,536
9Jul 3, 2026 13:2160,745515,661,318502,948,0001,242,0002,113,536