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 24, 2024 01:47MatthiasMatthiasScore: 34,445Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 24, 2024 01:4734,421315,123,509283,699,0001,997,0002,289,664
2Nov 24, 2024 01:4734,424308,712,656283,718,0001,998,0002,289,664
3Nov 24, 2024 01:4734,427312,367,163283,749,0001,998,0002,269,184
4Nov 24, 2024 01:4734,440312,770,172283,852,0001,998,0002,289,664
5Nov 24, 2024 01:4734,445309,137,494283,895,0001,999,0002,269,184
6Nov 24, 2024 01:4734,448309,100,661283,923,0001,999,0002,289,664
7Nov 24, 2024 01:4734,451315,822,631283,948,0001,999,0002,527,232
8Nov 24, 2024 01:4734,456314,585,927283,983,0001,999,0002,273,280
9Nov 24, 2024 01:4734,460312,965,247284,014,0002,000,0002,273,280