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 listJun 6, 2026 15:04merripiummerripiumScore: 81,325Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 15:0581,193683,095,365615,417,00058,486,0002,113,536
2Jun 6, 2026 15:0581,226683,286,798615,567,00058,611,0002,113,536
3Jun 6, 2026 15:0581,265683,643,006615,209,00059,291,0002,113,536
4Jun 6, 2026 15:0581,298683,923,167615,255,00059,526,0002,113,536
5Jun 6, 2026 15:0581,325684,198,081615,271,00059,730,0002,113,536
6Jun 6, 2026 15:0581,340684,443,647614,578,00060,550,0002,113,536
7Jun 6, 2026 15:0581,361684,430,772615,390,00059,907,0002,113,536
8Jun 6, 2026 15:0581,374684,517,846615,221,00060,184,0002,113,536
9Jun 6, 2026 15:0581,414684,877,621615,975,00059,762,0002,113,536