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 28, 2026 00:53Ondřej PolaneckýOndřej PolaneckýScore: 8,437Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2026 00:538,41695,193,42967,858,0001,995,0002,281,472
2Mar 28, 2026 00:538,43792,598,15969,028,0001,000,0002,281,472
3Mar 28, 2026 00:538,63197,992,15871,639,00002,400,256