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 29, 2026 14:00Saif Al-HarthiSaif Al-HarthiScore: 19,871Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 14:0119,480170,949,498160,685,0001,005,0002,113,536
2Jun 29, 2026 14:0119,739173,200,668162,832,0001,008,0002,113,536
3Jun 29, 2026 14:0119,803173,623,345163,367,0001,006,0002,113,536
4Jun 29, 2026 14:0119,868174,126,395163,908,0001,004,0002,113,536
5Jun 29, 2026 14:0119,871174,254,021163,928,0001,004,0002,113,536
6Jun 29, 2026 14:0119,936174,716,739164,464,0001,006,0002,113,536
7Jun 29, 2026 14:0119,939174,756,524164,489,0001,005,0002,113,536
8Jun 29, 2026 14:0119,943176,232,601164,527,0001,004,0002,113,536
9Jun 29, 2026 14:0120,127176,803,441166,051,0001,005,0002,113,536