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, 2025 08:45rogue *rogue *Score: 37,943Success
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, 2025 08:4537,943339,716,701312,927,0001,999,0002,519,040
2Oct 5, 2025 08:4537,943341,115,509313,930,000999,0002,510,848
3Oct 5, 2025 08:4537,946343,834,995312,955,0001,999,0002,387,968