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 listAug 27, 2026 01:49Victor MerckléVictor MerckléScore: 3,786Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 01:493,76539,467,33930,094,0001,159,0002,113,536
2Aug 27, 2026 01:493,76839,539,07730,147,0001,135,0002,113,536
3Aug 27, 2026 01:493,77139,799,90030,156,0001,147,0002,113,536
4Aug 27, 2026 01:493,77340,287,92130,183,0001,137,0002,113,536
5Aug 27, 2026 01:493,78639,728,75530,258,0001,166,0002,113,536
6Aug 27, 2026 01:493,79040,436,02630,300,0001,164,0002,113,536
7Aug 27, 2026 01:493,80141,089,00330,413,0001,139,0002,113,536
8Aug 27, 2026 01:493,84540,245,54230,802,0001,116,0002,113,536
9Aug 27, 2026 01:493,97641,945,94831,914,0001,087,0002,113,536