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 listNov 6, 2024 10:26Evgen BodunovEvgen BodunovScore: 1,828,618Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 6, 2024 10:261,825,99015,190,495,41415,096,750,00058,971,0002,289,664
2Nov 6, 2024 10:261,826,11815,194,137,15715,086,809,00069,971,0002,293,760
3Nov 6, 2024 10:261,826,46915,197,622,03015,102,713,00056,976,0002,281,472
4Nov 6, 2024 10:261,827,26215,201,487,23815,093,304,00072,967,0002,281,472
5Nov 6, 2024 10:261,828,61815,209,102,49515,103,560,00073,968,0002,281,472
6Nov 6, 2024 10:261,831,47515,242,835,22415,141,273,00059,973,0002,281,472
7Nov 6, 2024 10:261,831,65015,235,323,48815,132,728,00069,971,0002,293,760
8Nov 6, 2024 10:261,832,25415,242,064,61415,132,737,00074,968,0002,281,472
9Nov 6, 2024 10:261,911,98415,903,231,64415,800,498,00068,971,0002,281,472