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 14, 2026 22:10Ondřej PolaneckýOndřej PolaneckýScore: 47,655Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 22:1047,525420,528,979337,538,00056,922,0002,273,280
2Mar 14, 2026 22:1047,655420,852,475341,597,00053,936,0002,269,184
3Mar 14, 2026 22:1047,683420,893,420338,804,00056,967,0002,519,040