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 19:10merripiummerripiumScore: 63,530Success
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 19:1162,794530,296,817520,112,0001,081,0002,113,536
2Jun 6, 2026 19:1162,814532,980,778520,193,0001,165,0002,113,536
3Jun 6, 2026 19:1163,228533,877,864523,527,0001,269,0002,113,536
4Jun 6, 2026 19:1163,517536,370,407525,956,0001,236,0002,113,536
5Jun 6, 2026 19:1163,530536,402,553526,078,0001,225,0002,113,536
6Jun 6, 2026 19:1163,843540,327,076528,741,0001,156,0002,113,536
7Jun 6, 2026 19:1163,854539,091,241528,888,0001,101,0002,113,536
8Jun 6, 2026 19:1163,884539,289,624529,067,0001,178,0002,113,536
9Jun 6, 2026 19:1163,902539,734,922529,208,0001,180,0002,113,536