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 15, 2026 08:25eldon-chungeldon-chungScore: 55,745Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 08:2555,737485,821,832460,621,0001,998,0002,285,568
2Mar 15, 2026 08:2555,738495,789,023461,630,000999,0002,285,568
3Mar 15, 2026 08:2555,740483,234,647460,644,0001,998,0002,379,776
4Mar 15, 2026 08:2555,745488,644,255460,688,0001,998,0002,273,280
5Mar 15, 2026 08:2555,760490,424,396460,809,0001,999,0002,367,488
6Mar 15, 2026 08:2555,765485,548,820460,847,0001,999,0002,285,568