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 listMar 23, 2026 19:39Elijah KinElijah KinScore: 49,410Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 19:3949,395434,364,929408,978,000999,0002,260,992
2Mar 23, 2026 19:3949,400438,200,286408,022,0002,000,0002,265,088
3Mar 23, 2026 19:3949,401436,088,265408,032,0002,000,0002,265,088
4Mar 23, 2026 19:3949,403432,858,167408,045,0002,000,0002,265,088
5Mar 23, 2026 19:3949,410431,800,550410,103,00002,387,968
6Mar 23, 2026 19:3949,411433,337,563410,112,00002,371,584
7Mar 23, 2026 19:3949,419432,786,014410,181,00002,265,088
8Mar 23, 2026 19:3949,421432,565,017409,194,0001,000,0002,527,232
9Mar 23, 2026 19:3949,430435,027,680409,270,0001,000,0002,523,136