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 11, 2024 01:39zielajzielajScore: 6,157Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2024 01:396,08176,984,69650,469,00002,437,120
2Nov 11, 2024 01:396,08171,656,09350,475,00002,424,832
3Nov 11, 2024 01:396,08172,422,58450,474,00002,273,280
4Nov 11, 2024 01:396,08771,346,44050,525,00002,535,424
5Nov 11, 2024 01:396,09074,497,45250,549,00002,535,424
6Nov 11, 2024 01:396,09275,972,06750,565,00002,535,424
7Nov 11, 2024 01:396,15768,580,42249,097,0002,003,0002,506,752
8Nov 11, 2024 01:396,31273,278,04251,386,0001,007,0002,535,424
9Nov 11, 2024 01:396,36877,334,66051,861,000997,0002,428,928
10Nov 11, 2024 01:397,74485,809,28463,268,0001,004,0002,510,848
11Nov 11, 2024 01:397,94587,362,97063,942,0001,998,0002,531,328
12Nov 11, 2024 01:398,14994,818,23767,638,00002,531,328