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 listJan 17, 2024 19:27AnSaAnSaScore: 60,880Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 17, 2024 19:2658,187544,935,001482,951,63702,277,376
2Jan 17, 2024 19:2658,209558,664,717483,135,27902,281,472
3Jan 17, 2024 19:2658,289542,420,832483,796,32302,289,664
4Jan 17, 2024 19:2760,880563,312,688505,301,73202,285,568
5Jan 17, 2024 19:2760,905567,043,827505,510,23402,281,472
6Jan 17, 2024 19:2761,049577,420,572506,710,67602,273,280