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 10:52Igor ZyginIgor ZyginScore: 534,909Success
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 10:49534,3434,466,007,6544,390,074,00044,970,0002,342,912
2Nov 11, 2024 10:49534,5064,465,284,0394,377,423,00058,978,0002,527,232
3Nov 11, 2024 10:52534,5494,465,027,6854,383,798,00052,961,0002,342,912
4Nov 11, 2024 10:52534,9094,466,791,3634,387,770,00051,973,0002,531,328
5Nov 11, 2024 10:49534,9284,472,772,4104,374,946,00064,954,0002,359,296
6Nov 11, 2024 10:52536,6364,482,335,7964,380,110,00073,968,0002,461,696