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 30, 2026 08:06Saif Al-HarthiSaif Al-HarthiScore: 12,600Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 08:0812,560114,978,498103,235,0001,014,0002,113,536
2Jun 30, 2026 08:0812,567113,633,468103,297,0001,012,0002,113,536
3Jun 30, 2026 08:0812,571113,570,746103,335,0001,010,0002,113,536
4Jun 30, 2026 08:0812,583113,772,662103,430,0001,012,0002,113,536
5Jun 30, 2026 08:0812,600113,851,281103,576,0001,011,0002,113,536
6Jun 30, 2026 08:0812,600113,963,229103,569,0001,011,0002,113,536
7Jun 30, 2026 08:0812,602114,017,765103,588,0001,010,0002,113,536
8Jun 30, 2026 08:0812,612113,995,460103,673,0001,011,0002,113,536
9Jun 30, 2026 08:0812,872116,219,276105,827,0001,011,0002,113,536