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 11, 2025 04:54Marco BarboneMarco BarboneScore: 29,173Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2025 04:5429,171265,459,446241,119,0001,000,0002,281,472
2Oct 11, 2025 04:5429,173266,647,982241,135,0001,000,0002,289,664
3Oct 11, 2025 04:5429,202272,558,927241,379,0001,001,0002,277,376