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 listOct 14, 2024 00:10Joad NacerJoad NacerScore: 4,360Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2024 00:104,31967,997,24333,854,0001,991,0002,301,952
2Oct 14, 2024 00:104,32058,091,57732,866,0002,987,0002,387,968
3Oct 14, 2024 00:104,35358,778,66033,117,0003,010,0002,535,424
4Oct 14, 2024 00:104,36059,029,34035,185,0001,005,0002,531,328
5Oct 14, 2024 00:104,40863,114,56936,588,00002,531,328
6Oct 14, 2024 00:104,75062,804,77936,393,0003,032,0002,301,952