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 12, 2024 12:51SergeySergeyScore: 394,757Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 12, 2024 12:51393,6723,301,529,2923,192,514,00074,965,0002,293,760
2Nov 12, 2024 12:51394,1153,300,449,2203,213,191,00057,967,0002,289,664
3Nov 12, 2024 12:51394,2583,298,372,2363,224,368,00047,975,0002,285,568
4Nov 12, 2024 12:51394,5583,303,779,2423,202,859,00071,974,0002,285,568
5Nov 12, 2024 12:51394,7573,303,553,7513,208,515,00067,968,0002,293,760
6Nov 12, 2024 12:51395,8993,313,633,4973,224,998,00060,962,0002,285,568
7Nov 12, 2024 12:51396,6433,323,905,3223,219,182,00072,958,0002,363,392
8Nov 12, 2024 12:51398,6153,332,373,6773,246,533,00061,972,0002,367,488
9Nov 12, 2024 12:51423,8143,545,043,6983,457,679,00059,977,0002,285,568