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 20, 2026 14:54Anchen0823Anchen0823Score: 42,985Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 20, 2026 14:5442,961368,748,468355,578,0001,004,0002,117,632
2Oct 20, 2026 14:5442,974367,537,602354,674,0002,017,0002,117,632
3Oct 20, 2026 14:5442,977367,488,111355,707,0001,004,0002,117,632
4Oct 20, 2026 14:5442,978367,527,466355,721,0001,004,0002,117,632
5Oct 20, 2026 14:5442,985367,315,669355,770,0001,007,0002,117,632
6Oct 20, 2026 14:5442,987367,550,296355,793,0001,006,0002,117,632
7Oct 20, 2026 14:5442,990367,623,248355,814,0001,004,0002,117,632
8Oct 20, 2026 14:5443,004367,662,779355,936,0001,004,0002,117,632
9Oct 20, 2026 14:5443,013368,662,142354,961,0002,054,0002,117,632