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 02:46zielajzielajScore: 3,746Success
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 02:463,59655,047,95029,844,00002,523,136
2Nov 16, 2024 02:463,60354,117,15327,915,0001,993,0002,523,136
3Nov 16, 2024 02:463,63452,361,81828,154,0002,011,0002,355,200
4Nov 16, 2024 02:463,74652,950,46129,084,0002,005,0002,363,392
5Nov 16, 2024 02:463,76758,237,59930,262,0001,008,0002,277,376
6Nov 16, 2024 02:463,84053,680,31130,844,0001,028,0002,277,376