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 16, 2025 23:10Amit RahmanAmit RahmanScore: 1,826,336Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 16, 2025 23:101,825,30615,194,644,86315,093,064,00056,973,0002,277,376
2Jan 16, 2025 23:101,825,63815,181,619,97515,070,832,00081,966,0002,289,664
3Jan 16, 2025 23:101,825,77315,184,232,62315,093,947,00059,971,0002,277,376
4Jan 16, 2025 23:101,825,84215,195,133,41315,086,517,00067,970,0002,277,376
5Jan 16, 2025 23:101,826,33615,189,193,32015,096,620,00061,969,0002,289,664
6Jan 16, 2025 23:101,828,99915,212,047,74515,110,724,00069,966,0002,277,376
7Jan 16, 2025 23:101,829,80115,223,255,77415,107,381,00079,964,0002,277,376
8Jan 16, 2025 23:101,830,40615,222,319,97415,127,398,00064,971,0002,277,376
9Jan 16, 2025 23:101,836,46115,274,798,65015,183,650,00058,975,0002,277,376