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 listJul 9, 2026 15:02boop34boop34Score: 58,283Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 15:0357,935491,175,687479,803,0001,060,0002,113,536
2Jul 9, 2026 15:0358,073492,300,516480,946,0001,066,0002,113,536
3Jul 9, 2026 15:0358,160492,595,762481,638,0001,091,0002,113,536
4Jul 9, 2026 15:0358,257493,314,061482,425,0001,115,0002,113,536
5Jul 9, 2026 15:0358,283494,719,511482,747,0001,006,0002,113,536
6Jul 9, 2026 15:0358,323494,331,942483,025,0001,059,0002,113,536
7Jul 9, 2026 15:0358,353494,056,630483,226,0001,110,0002,113,536
8Jul 9, 2026 15:0358,372494,772,740483,445,0001,044,0002,113,536
9Jul 9, 2026 15:0358,393494,380,661483,632,0001,033,0002,113,536