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 28, 2021 21:37Yuriy LyfenkoYuriy LyfenkoScore: 19,166Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 28, 2021 21:3719,130181,220,124156,779,0001,997,0002,260,992
2May 28, 2021 21:3719,139184,014,491156,856,0001,998,0002,260,992
3May 28, 2021 21:3719,142189,553,362156,877,0001,998,0002,260,992
4May 28, 2021 21:3719,147188,835,859157,924,000999,0002,387,968
5May 28, 2021 21:3719,159189,792,230158,021,0001,000,0002,260,992
6May 28, 2021 21:3719,161191,658,213158,033,0001,000,0002,260,992
7May 28, 2021 21:3719,166187,864,398157,077,0002,000,0002,387,968
8May 28, 2021 21:3719,172191,684,592158,127,0001,000,0002,387,968
9May 28, 2021 21:3719,176186,938,422158,160,0001,001,0002,260,992
10May 28, 2021 21:3719,441234,140,513161,359,89902,260,992
11May 28, 2021 21:3719,559207,727,486162,336,70302,269,184
12May 28, 2021 21:3719,564203,577,054162,378,42702,265,088