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 listDec 21, 2024 14:13LaihoLaihoScore: 109,413Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 21, 2024 14:13109,138927,553,463903,849,0001,999,0002,285,568
2Dec 21, 2024 14:13109,274937,749,405905,974,000999,0002,363,392
3Dec 21, 2024 14:13109,282930,941,451906,038,0001,000,0002,285,568
4Dec 21, 2024 14:13109,335934,035,368906,480,000999,0002,482,176
5Dec 21, 2024 14:13109,413936,748,915907,130,0001,000,0002,285,568
6Dec 21, 2024 14:13109,420934,442,555907,183,000999,0002,285,568
7Dec 21, 2024 14:13109,515938,834,656907,976,000999,0002,285,568
8Dec 21, 2024 14:13110,035939,880,189911,289,0001,998,0002,285,568
9Dec 21, 2024 14:13110,155945,799,076912,288,0001,998,0002,281,472