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 listMar 19, 2026 02:21Ondřej PolaneckýOndřej PolaneckýScore: 52,960Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 02:2152,955466,912,664437,533,0001,997,0002,273,280
2Mar 19, 2026 02:2152,960468,911,313437,569,0001,998,0002,404,352
3Mar 19, 2026 02:2152,961467,713,677438,580,000999,0002,387,968