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 28, 2026 08:55A_ShamanA_ShamanScore: 48,225Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 08:5748,120410,043,691398,285,0001,112,0002,113,536
2Jun 28, 2026 08:5748,124408,762,844398,340,0001,095,0002,113,536
3Jun 28, 2026 08:5748,141409,047,889398,518,0001,053,0002,113,536
4Jun 28, 2026 08:5748,142409,165,942398,521,0001,064,0002,113,536
5Jun 28, 2026 08:5748,225410,222,023399,062,0001,209,0002,113,536
6Jun 28, 2026 08:5748,253409,803,651399,377,0001,130,0002,113,536
7Jun 28, 2026 08:5748,261409,838,337399,509,0001,062,0002,113,536
8Jun 28, 2026 08:5748,265410,546,124399,551,0001,049,0002,113,536
9Jun 28, 2026 08:5748,304410,429,508399,867,0001,063,0002,113,536