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 listFeb 24, 2026 11:37satoru.netsatoru.netScore: 38,406Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 11:3738,395349,805,718316,679,0001,997,0002,277,376
2Feb 24, 2026 11:3738,406347,924,587317,771,000999,0002,277,376
3Feb 24, 2026 11:3738,410348,152,928316,809,0001,998,0002,404,352