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 13, 2024 12:39Igor ZyginIgor ZyginScore: 88,283Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 13, 2024 12:3987,987755,533,318655,363,00074,927,0002,342,912
2Nov 13, 2024 12:3988,083759,346,356660,078,00071,008,0002,318,336
3Nov 13, 2024 12:3988,108763,079,173657,369,00073,929,0002,371,584
4Nov 13, 2024 12:3988,239759,597,799659,444,00072,938,0002,416,640
5Nov 13, 2024 12:3988,283763,448,428657,778,00074,974,0002,318,336
6Nov 13, 2024 12:3988,472759,534,418659,388,00074,930,0002,318,336
7Nov 13, 2024 12:3988,671761,706,953660,975,00074,997,0002,318,336
8Nov 13, 2024 12:3988,761762,019,495660,745,00075,970,0002,420,736
9Nov 13, 2024 12:3988,837763,050,669663,415,00073,934,0002,416,640