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 listJan 28, 2025 15:29David-AntunesDavid-AntunesScore: 1,826,901Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 28, 2025 15:291,825,70715,183,683,42015,077,401,00075,971,0002,277,376
2Jan 28, 2025 15:291,825,91715,194,969,89615,083,138,00071,972,0002,265,088
3Jan 28, 2025 15:291,826,15515,190,343,23215,091,116,00065,974,0002,277,376
4Jan 28, 2025 15:291,826,59915,195,116,07515,089,803,00070,966,0002,293,760
5Jan 28, 2025 15:291,826,90115,194,786,54515,089,318,00073,962,0002,289,664
6Jan 28, 2025 15:291,827,32715,199,347,28615,104,838,00061,974,0002,269,184
7Jan 28, 2025 15:291,830,34215,223,081,86715,120,876,00070,966,0002,277,376
8Jan 28, 2025 15:291,831,10615,233,439,91015,131,213,00066,969,0002,277,376
9Jan 28, 2025 15:291,918,80915,956,383,51015,869,141,00056,971,0002,277,376