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 listOct 15, 2024 20:50Elnur RakhmatullinElnur RakhmatullinScore: 48,730Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2024 20:5048,704426,822,314402,245,0002,001,0002,277,376
2Oct 15, 2024 20:5048,713431,623,455402,316,0002,001,0002,277,376
3Oct 15, 2024 20:5048,716428,557,614404,344,00002,535,424
4Oct 15, 2024 20:5048,725435,776,202403,415,0001,001,0002,277,376
5Oct 15, 2024 20:5048,730434,004,060403,458,0001,001,0002,514,944
6Oct 15, 2024 20:5048,731429,311,807403,467,0001,001,0002,281,472
7Oct 15, 2024 20:5048,734436,238,432403,495,0001,001,0002,277,376
8Oct 15, 2024 20:5048,749429,795,246401,620,0002,997,0002,277,376
9Oct 15, 2024 20:5048,749436,270,844401,621,0002,997,0002,269,184