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:36zielajzielajScore: 3,569Success
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:363,51149,231,60428,135,0001,004,0002,347,008
2Nov 16, 2024 20:363,52251,398,49927,215,0002,015,0002,527,232
3Nov 16, 2024 20:363,52760,389,84928,261,0001,009,0002,527,232
4Nov 16, 2024 20:363,53657,714,82028,338,0001,012,0002,351,104
5Nov 16, 2024 20:363,56460,863,33029,580,00002,523,136
6Nov 16, 2024 20:363,56656,974,64529,597,00002,523,136
7Nov 16, 2024 20:363,56957,156,17928,601,0001,021,0002,527,232
8Nov 16, 2024 20:363,57358,868,99628,636,0001,022,0002,355,200
9Nov 16, 2024 20:363,59656,352,19228,852,000994,0002,527,232
10Nov 16, 2024 20:363,76957,772,20829,261,0002,018,0002,277,376
11Nov 16, 2024 20:363,79459,566,98530,478,0001,015,0002,355,200
12Nov 16, 2024 20:363,79950,239,74231,529,00002,359,296