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 20:16Ondřej PolaneckýOndřej PolaneckýScore: 9,589Success
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 20:169,563106,456,68878,366,0001,004,0002,281,472
2Mar 28, 2026 20:169,589104,679,59278,585,0001,007,0002,404,352
3Mar 28, 2026 20:169,593110,706,32278,619,0001,007,0002,392,064