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 10, 2024 21:15Mikhail OrlovMikhail OrlovScore: 1,827,387Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 10, 2024 21:151,825,57615,183,503,16415,092,311,00059,973,0002,281,472
2Nov 10, 2024 21:151,825,96715,185,862,43315,089,553,00065,971,0002,273,280
3Nov 10, 2024 21:151,826,83315,193,138,92715,084,747,00077,967,0002,289,664
4Nov 10, 2024 21:151,827,24915,204,389,75815,112,188,00053,975,0002,289,664
5Nov 10, 2024 21:151,827,38715,205,770,15115,102,333,00064,975,0002,281,472
6Nov 10, 2024 21:151,829,26515,215,495,90915,126,925,00055,973,0002,281,472
7Nov 10, 2024 21:151,830,44415,225,351,08715,137,712,00054,977,0002,514,944
8Nov 10, 2024 21:151,832,68715,242,940,67115,151,327,00059,977,0002,281,472
9Nov 10, 2024 21:151,911,68415,895,969,10015,807,004,00059,977,0002,281,472