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 18, 2026 02:00Elijah KinElijah KinScore: 52,024Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 02:0052,003455,281,303430,626,000999,0002,273,280
2Mar 18, 2026 02:0052,024455,078,638429,804,0001,999,0002,519,040
3Mar 18, 2026 02:0052,040460,247,544430,935,000999,0002,265,088