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 7, 2026 18:56Victor MerckléVictor MerckléScore: 7,703Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 18:577,35968,808,11959,997,0001,088,0002,113,536
2Jun 7, 2026 18:577,36968,831,20960,106,0001,058,0002,113,536
3Jun 7, 2026 18:577,39770,698,64860,340,0001,056,0002,113,536
4Jun 7, 2026 18:577,41569,184,63260,511,0001,034,0002,113,536
5Jun 7, 2026 18:577,70371,660,97362,867,0001,068,0002,113,536
6Jun 7, 2026 18:577,73571,851,35563,185,0001,022,0002,113,536
7Jun 7, 2026 18:577,73671,888,09563,186,0001,028,0002,113,536
8Jun 7, 2026 18:577,73871,892,18763,211,0001,015,0002,113,536
9Jun 7, 2026 18:577,75071,978,94363,291,0001,039,0002,113,536