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 listMay 10, 2026 10:22wnwnScore: 3,507Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 10:233,37346,513,40826,936,0001,068,0002,482,176
2May 10, 2026 10:233,37642,078,04026,993,0001,031,0002,494,464
3May 10, 2026 10:233,39843,808,95427,112,0001,099,0002,473,984
4May 10, 2026 10:233,42344,455,36327,276,0001,139,0002,486,272
5May 10, 2026 10:233,50743,772,53928,050,0001,064,0002,478,080
6May 10, 2026 10:233,55145,292,02428,392,0001,089,0002,490,368
7May 10, 2026 10:233,56645,099,11828,516,0001,086,0002,482,176
8May 10, 2026 10:233,58545,042,52828,603,0001,153,0002,482,176
9May 10, 2026 10:233,59443,715,65728,742,0001,095,0002,490,368