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 2, 2026 05:50Karthik ReddyKarthik ReddyScore: 3,291Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2026 05:513,2783,036,270,10827,215,000020,480
2Oct 2, 2026 05:513,2863,036,354,84627,274,000020,480
3Oct 2, 2026 05:513,2863,036,358,17927,280,000020,480
4Oct 2, 2026 05:513,2883,036,373,14027,292,000020,480
5Oct 2, 2026 05:513,2913,036,453,64227,322,000020,480
6Oct 2, 2026 05:513,2933,036,374,55827,338,000020,480
7Oct 2, 2026 05:513,2943,036,441,32627,346,000020,480
8Oct 2, 2026 05:513,2953,036,413,52027,351,000020,480
9Oct 2, 2026 05:513,3273,036,659,34627,621,000020,480