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 20, 2024 20:26gordgordScore: 1,828,336Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 20, 2024 20:261,824,75315,177,737,94115,064,486,00080,964,0002,281,472
2Oct 20, 2024 20:261,826,22015,191,322,21315,100,648,00056,976,0002,289,664
3Oct 20, 2024 20:261,826,32615,191,277,19315,075,543,00082,964,0002,281,472
4Oct 20, 2024 20:261,826,55515,191,575,25815,089,436,00070,973,0002,281,472
5Oct 20, 2024 20:261,828,33615,206,814,11815,106,217,00068,969,0002,289,664
6Oct 20, 2024 20:261,828,50115,211,227,94115,111,583,00064,972,0002,281,472
7Oct 20, 2024 20:261,828,63015,213,748,43015,120,655,00056,976,0002,281,472
8Oct 20, 2024 20:261,858,39515,462,508,48215,342,721,00081,961,0002,293,760
9Oct 20, 2024 20:261,956,25016,267,489,13416,176,898,00059,977,0002,281,472