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 16, 2024 20:42zielajzielajError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 16, 2024 20:2000000Error: Killed by timeoutstderr
2Nov 16, 2024 20:423,52850,968,10628,273,0001,009,0002,527,232
3Nov 16, 2024 20:213,53656,052,62328,340,0001,012,0002,355,200
4Nov 16, 2024 20:213,53753,897,00027,334,0002,024,0002,334,720
5Nov 16, 2024 20:423,54950,482,68228,443,0001,015,0002,355,200
6Nov 16, 2024 20:423,55551,988,08928,487,0001,017,0002,351,104
7Nov 16, 2024 20:213,59761,745,91328,860,000995,0002,527,232
8Nov 16, 2024 20:213,73452,252,94629,994,000999,0002,531,328
9Nov 16, 2024 20:213,74654,502,53030,088,0001,002,0002,363,392
10Nov 16, 2024 20:423,76157,916,28429,201,0002,013,0002,363,392
11Nov 16, 2024 20:213,77055,648,69730,279,0001,009,0002,363,392
12Nov 16, 2024 20:423,78355,034,16930,388,0001,012,0002,277,376
13Nov 16, 2024 20:423,78955,526,93731,445,00002,527,232