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 01:00Joad NacerJoad NacerScore: 4,592Success
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 01:004,42268,593,69733,648,0003,058,0002,289,664
2Oct 14, 2024 01:004,47359,604,24033,109,0004,013,0002,289,664
3Oct 14, 2024 01:004,59157,848,81935,096,0003,008,0002,375,680
4Oct 14, 2024 01:004,59258,803,09135,106,0003,009,0002,531,328
5Oct 14, 2024 01:004,67964,931,29035,852,0002,987,0002,535,424
6Oct 14, 2024 01:004,71663,949,78735,130,0004,014,0002,273,280