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 listOct 5, 2026 09:32Karthik ReddyKarthik ReddyScore: 3,447Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2026 09:333,4173,037,325,35428,363,000020,480
2Oct 5, 2026 09:333,4293,037,453,03528,464,000020,480
3Oct 5, 2026 09:333,4323,038,122,53028,487,000020,480
4Oct 5, 2026 09:333,4433,038,818,83828,578,000020,480
5Oct 5, 2026 09:333,4473,037,489,08828,614,000020,480
6Oct 5, 2026 09:333,4483,037,666,54427,593,0001,033,00020,480
7Oct 5, 2026 09:333,4493,037,631,73028,633,000020,480
8Oct 5, 2026 09:333,4643,037,712,56128,756,000020,480
9Oct 5, 2026 09:333,4663,037,493,86328,772,000020,480