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 10, 2025 02:46Marco BarboneMarco BarboneScore: 71,432Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 10, 2025 02:4671,203616,020,257588,982,0001,999,0002,289,664
2Oct 10, 2025 02:4671,432614,642,548591,884,000999,0002,269,184
3Oct 10, 2025 02:4671,512617,459,437592,547,000999,0002,269,184